翻訳と辞書 |
weak duality : ウィキペディア英語版 | weak duality In applied mathematics, weak duality is a concept in optimization which states that the duality gap is always greater than or equal to 0. That means the solution to the primal (minimization) problem is ''always'' greater than or equal to the solution to an associated dual problem. This is opposed to strong duality which only holds in certain cases.〔.〕 ==Uses== Many primal-dual approximation algorithms are based on the principle of weak duality.〔.〕
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「weak duality」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|